from collections import *
input()
p = list(map(int, input().split()))
a = sorted(p)
mx = max(p)
c = [0]*(mx+1)
for i in a:
c[i] += 1
if not all(c[a]>=c[a+1] for a in range(1, mx)):
print(-1)
exit(0)
print(max(c))
for i in p:
print(c[i], end=' ')
c[i] -= 1
print()
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
int n;
cin>>n;
int arr[n];
vector<pair<int,int>>dp;
for(int i=0;i<n;i++){
cin>>arr[i];
dp.push_back({arr[i],i});
}
sort(dp.begin(),dp.end());
int ans=1;
bool flag=true;
int cnt=1;
int p=1;
arr[0]=1;
if(dp[0].first!=1){
cout<<-1<<endl;
}
else{
for(int i=1;i<n;i++){
if(dp[i].first==1){
ans++;
p++;
cnt++;
arr[dp[i].second]=ans;
continue;
}
if(dp[i].first-dp[i-1].first>1){
flag=false;
}
if(dp[i].first!=dp[i-1].first){
if(cnt>p){
flag=false;
break;
}
else{
p=cnt;
cnt=0;
}
}
cnt++;
arr[dp[i].second]=cnt;
}
if(cnt>p||flag==false){
cout<<-1<<endl;
}
else{
cout<<ans<<endl;
for(int i=0;i<n;i++)
cout<<arr[i]<<" ";
cout<<endl;
}
}
return 0;
}497. Random Point in Non-overlapping Rectangles | 528. Random Pick with Weight |
470. Implement Rand10() Using Rand7() | 866. Prime Palindrome |
1516A - Tit for Tat | 622. Design Circular Queue |
814. Binary Tree Pruning | 791. Custom Sort String |
787. Cheapest Flights Within K Stops | 779. K-th Symbol in Grammar |
701. Insert into a Binary Search Tree | 429. N-ary Tree Level Order Traversal |
739. Daily Temperatures | 647. Palindromic Substrings |
583. Delete Operation for Two Strings | 518. Coin Change 2 |
516. Longest Palindromic Subsequence | 468. Validate IP Address |
450. Delete Node in a BST | 445. Add Two Numbers II |
442. Find All Duplicates in an Array | 437. Path Sum III |
436. Find Right Interval | 435. Non-overlapping Intervals |
406. Queue Reconstruction by Height | 380. Insert Delete GetRandom O(1) |
332. Reconstruct Itinerary | 368. Largest Divisible Subset |
377. Combination Sum IV | 322. Coin Change |